A Hardy-Ramanujan-Rademacher-type formula for (r, s)-regular partitions
نویسندگان
چکیده
Let pr,s(n) denote the number of partitions of a positive integer n into parts containing no multiples of r or s, where r > 1 and s > 1 are square-free, relatively prime integers. We use classical methods to derive a Hardy-Ramanujan-Rademacher-type infinite series for pr,s(n).
منابع مشابه
A Rademacher Type Formula for Partitions and Overpartitions
A Rademacher-type convergent series formula which generalizes the Hardy-Ramanujan-Rademacher formula for the number of partitions of n and the Zuckerman formula for the Fourier coefficients of θ4(0 | τ)−1 is presented. 1. Background 1.1. Partitions. A partition of an integer n is a representation of n as a sum of positive integers, where the order of the summands (called parts) is considered ir...
متن کاملTowards an automation of the circle method
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are pr...
متن کاملEfficient implementation of the Hardy{--}Ramanujan{--}Rademacher formula
We describe how the Hardy–Ramanujan–Rademacher formula can be implemented to allow the partition function p(n) to be computed with softly optimal complexity O(n) and very little overhead. A new implementation based on these techniques achieves speedups in excess of a factor 500 over previously published software and has been used by the author to calculate p(10), an exponent twice as large as i...
متن کاملEquidistribution of Heegner points and the partition function
Let p(n) denote the number of partitions of a positive integer n. In this paper we study the asymptotic growth of p(n) using the equidistribution of Galois orbits of Heegner points on the modular curve X0(6). We obtain a new asymptotic formula for p(n)with an effective error termwhich is O(n−( 1 2+δ)) for some δ > 0.We then use this asymptotic formula to sharpen the classical bounds of Hardy an...
متن کاملA formula for the partition function that “counts”
We derive a combinatorial multisum expression for the number D(n, k) of partitions of n with Durfee square of order k. An immediate corollary is therefore a combinatorial formula for p(n), the number of partitions of n. We then study D(n, k) as a quasipolynomial. We consider the natural polynomial approximation D̃(n, k) to the quasipolynomial representation of D(n, k). Numerically, the sum ∑ 1≤k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011